Trisections and cubes in elliptic curves

نویسندگان

چکیده

We show how to compute the pre-images of multiplication by 3 in group points an elliptic curve E over a field k characteristic different from 2 and such that E[3](k)=E[3]. Q=(xQ,yQ)∈[3]E(k) if only yQ−d−m(xQ−c) is cube for every 3-torsion point (c,d)∈E[3], where m slope tangent at (c,d). reduce our problem computation most independent cubic roots plus few polynomial operations.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Elliptic Nets and Elliptic Curves

Elliptic divisibility sequences are integer recurrence sequences, each of which is associated to an elliptic curve over the rationals together with a rational point on that curve. In this paper we present a higher-dimensional analogue over arbitrary base fields. Suppose E is an elliptic curve over a field K, and P1, . . . , Pn are points on E defined over K. To this information we associate an ...

متن کامل

Generalized Jacobian and Discrete Logarithm Problem on Elliptic Curves

Let E be an elliptic curve over the finite field F_{q}, P a point in E(F_{q}) of order n, and Q a point in the group generated by P. The discrete logarithm problem on E is to find the number k such that Q = kP. In this paper we reduce the discrete logarithm problem on E[n] to the discrete logarithm on the group F*_{q} , the multiplicative group of nonzero elements of Fq, in the case where n | q...

متن کامل

Elliptic Curves and Cryptography

results in more than 30.000 hits, ranging from articles in mathematics and computer science to books and implementations and applications of the algorithms. There are a lot of different algorithms and also different ways to attack them, many of them involving a huge amount of theory. Moreover, the fact that still there is not an accepted standard on elliptic curve cryptography benefits the exis...

متن کامل

Elliptic Curves and Cryptography

Elliptic curves also figured prominently in the recent proof of Fermat's Last Theorem by Andrew Wiles. Originally pursued for purely aesthetic reasons, elliptic curves have recently been utilized in devising algorithms for factoring integers, primality proving, and in public-key cryptography. In this article, we aim to give the reader an introduction to elliptic curve cryptosystems, and to demo...

متن کامل

Elliptic curves and modularity

The discriminant Define b2 := a1 + 4a2, b4 := 2a4 + a1a3, b6 := a3 + 4a6, b8 := a1a6 + 4a2a6 − a1a3a4 + a2a3 − a4. Note that if char(K) 6= 2, then we can perform the coordinate transformation y 7→ (y− a1x− a3)/2 to arrive at an equation y = 4x + b2x +2b4x+ b6. Now for any Weierstrass equation we define its discriminant ∆ := −b2b8 − 8b4 − 27b6 + 9b2b4b6. Proposition 1. A curve C/K given by a Wei...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Pure and Applied Algebra

سال: 2023

ISSN: ['1873-1376', '0022-4049']

DOI: https://doi.org/10.1016/j.jpaa.2022.107259